Representative Association Rules and Minimum Condition Maximum Consequence Association Rules

نویسنده

  • Marzena Kryszkiewicz
چکیده

Discovering association rules (AR) among items in a large database is an important database mining problem. The number of association rules may be large. To alleviate this problem, we introduced in [1] a notion of representative association rules (RR). RR is a least set of rules that covers all association rules. The association rules, which are not representative ones, may be generated by means of a cover operator without accessing a database. On the other hand, a subset of association rules that allows to predict as much as possible from minimum facts is ~ l y of interest to analysts, This kind of rules we will call minimum condition maximum consequence rules (M~R). In this paper, we investigate the relationship between RR andM3AR. We prove that MMR is a subset of RR and it may be extracted from RR. I I n t r o d u c t i o n Discovering association rules (AR) among items in large databases is recognized as an important database mining problem. The problem was introduced in [2] for sales transaction database. The association rules identify sets of items that are purchased together with other sets of items. For example, an association rule may state that 90% of customers who buy butter and bread buy also milk. Several extensions of the notion of an association rule were offered in the literaatre (see e.g. [3-4]). One of such extensions is a generalized rule that can be discovered from a taxonomic database [3]. Applications for association rules range from decision support to telecommunications alarm diagnosis and prediction [5-6]. The number of association roles is usually large. A user should not be presented with all of them, but rather with these which are original, novel, interesting. There were proposed several definitions of what is an interesting association rule (see e.g. [3,7]). In particular, pruning out uninteresting rules which exploits the information in taxonomies seems to be quite useful (resulting in the rule number reduction amounting to 60% [31). The interestingness of a ride is usually expressed by some quantitative measure.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Identifying and Evaluating Effective Factors in Green Supplier Selection using Association Rules Analysis

Nowadays companies measure suppliers on the basis of a variety of factors and criteria that affect the supplier's selection issue. This paper intended to identify the key effective criteria for selection of green suppliers through an efficient algorithm callediterative process mining or i-PM. Green data were collected first by reviewing the previous studies to identify various environmental cri...

متن کامل

Fuzzy Apriori Rule Extraction Using Multi-Objective Particle Swarm Optimization: The Case of Credit Scoring

There are many methods introduced to solve the credit scoring problem such as support vector machines, neural networks and rule based classifiers. Rule bases are more favourite in credit decision making because of their ability to explicitly distinguish between good and bad applicants.In this paper multi-objective particle swarm is applied to optimize fuzzy apriori rule base in credit scoring. ...

متن کامل

Fuzzy Apriori Rule Extraction Using Multi-Objective Particle Swarm Optimization: The Case of Credit Scoring

There are many methods introduced to solve the credit scoring problem such as support vector machines, neural networks and rule based classifiers. Rule bases are more favourite in credit decision making because of their ability to explicitly distinguish between good and bad applicants.In this paper multi-objective particle swarm is applied to optimize fuzzy apriori rule base in credit scoring. ...

متن کامل

Finding Non-Coincidental Sporadic Rules Using Apriori-Inverse

Discovering association rules efficiently is an important data mining problem. We define sporadic rules as those with low support but high confidence; for example, a rare association of two symptoms indicating a rare disease. To find such rules using the well-known Apriori algorithm, minimum support has to be set very low, producing a large number of trivial frequent itemsets. To alleviate this...

متن کامل

Exploring the Relationships between Spatial and Demographic Parameters and Urban Water Consumption in Esfahan Using Association Rule Mining

In recent years, Iran has faced serious water scarcity and excessive use of water resources. Therefore, exploring the pattern of urban water consumption and the relationships between geographic and demographic parameters and water usage is an important requirement for effective management of water resources. In this study, association rule mining has been used to analyze the data of municipal w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998